A New Algorithm for Post-Processing Covering Arrays
نویسندگان
چکیده
منابع مشابه
A New Algorithm for Post-Processing Covering Arrays
Software testing is a critical component of modern software development. For this reason, it has been one of the most active research topics for several years, resulting in many different algorithms, methodologies and tools. Combinatorial testing is one of the most important testing strategies. The test generation problem for combinatorial testing can be modeled as constructing a matrix which h...
متن کاملA parallel algorithm for the verification of Covering Arrays
Covering Arrays (CAs) are combinatorial objects that, with a small number of cases, cover a certain level of interaction of a set of parameters. CAs have found application in a variety of fields where interactions among factors need to be identified; some of these fields are biology, agriculture, medicine, and software and hardware testing. In particular, a covering array is an N × k matrix ove...
متن کاملA density-based greedy algorithm for higher strength covering arrays
Algorithmic construction of software interaction test suites has focussed on pairwise coverage; less is known about the efficient construction of test suites for t-way interactions with t≥3. This study extends an efficient density-based algorithm for pairwise coverage to generate t-way interaction test suites and shows that it guarantees a logarithmic upper bound on the size of the test suites ...
متن کاملA New Backtracking Algorithm for Constructing Binary Covering Arrays of Variable Strength
A Covering Array denoted by CA(N ; t, k, v) is a matrix of size N × k, in which each of the v combinations appears at least once in every t columns. Covering Arrays (CAs) are combinatorial objects used in software testing. There are different methods to construct CAs, but as it is a highly combinatorial problem, few complete algorithms to construct CAs have been reported. In this paper a new ba...
متن کاملA cross entropy algorithm for continuous covering location problem
Covering problem tries to locate the least number of facilities and each demand has at least one facility located within a specific distance.This paper considers a cross entropy algorithm for solving the mixed integer nonlinear programming (MINLP) for covering location model.The model is solved to determine the best covering value.Also, this paper proposes aCross Entropy (CE) algorithm consider...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2015
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2015.061234